An Improved Gradient-Based Optimization Algorithm for Solving Complex Optimization Problems

نویسندگان

چکیده

In this paper, an improved gradient-based optimizer (IGBO) is proposed with the target of improving performance and accuracy algorithm for solving complex optimization engineering problems. The IGBO has added features adjusting best solution by adding inertia weight, fast convergence rate modified parameters, as well avoiding local optima using a novel functional operator (G). These make it feasible majority nonlinear problems which quite hard to achieve original version GBO. effectiveness scalability are evaluated well-known benchmark functions. Moreover, statistically analyzed ANOVA analysis, Holm–Bonferroni test. addition, was assessed real-world results functions show that very competitive, superior compared its competitors in finding optimal solutions high coverage. studied real prove superiority difficult indefinite search domains.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems

In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...

متن کامل

An Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems

Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...

متن کامل

FOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems

These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...

متن کامل

An Improved Bees Algorithm For Solving Optimization Mechanical Problems

This paper describes the first application of the Bees Algorithm to optimization problems. The Bees Algorithm (BA) is a search procedure inspired by the way honey bees forage for food. The paper presents the results obtained showing the robust performance of the BA. The results of comparative studies of the Bees Algorithm against other various discrete and continuous optimization algorithms for...

متن کامل

An improved genetic algorithm for solving simulation optimization problems

Simulation optimization studies the problem of optimizing simulation-based objectives. Simulation optimization is a new and hot topic in the field of system simulation and operational research. To improve the search efficiency, this paper presents a hybrid approach which combined genetic algorithm and local optimization technique for simulation optimization problems. Through the combination of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Processes

سال: 2023

ISSN: ['2227-9717']

DOI: https://doi.org/10.3390/pr11020498